347. Top K Frequent Elements - LeetCode Solution


Array Hash table Counting Heap Sorting

Python Code:

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        arr = []
        dict1 = {}
        
        for num in nums:
            if num in dict1:
                dict1[num] +=1
                
            else:
                dict1[num] = 1
        for i in dict1:
            arr.append([dict1[i], i])
        
        arr.sort(reverse  = True)
        ans = []
        for i in range(k):
            ans.append(arr[i][1])
        return ans


Comments

Submit
0 Comments
More Questions

431B - Shower Line
282C - XOR and OR
1582B - Luntik and Subsequences
609A - Флеш-карты
1207A - There Are Two Types Of Burgers
371C - Hamburgers
343B - Alternating Current
758B - Blown Garland
1681B - Card Trick
1592A - Gamer Hemose
493D - Vasya and Chess
1485A - Add and Divide
337B - Routine Problem
1392D - Omkar and Bed Wars
76E - Points
762C - Two strings
802M - April Fools' Problem (easy)
577B - Modulo Sum
1555B - Two Tables
1686A - Everything Everywhere All But One
1469B - Red and Blue
1257B - Magic Stick
18C - Stripe
1203B - Equal Rectangles
1536A - Omkar and Bad Story
1509A - Average Height
1506C - Double-ended Strings
340A - The Wall
377A - Maze
500A - New Year Transportation